An iterative method with error estimators

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ITERATIVE METHOD FOR SOLVING TWO-DIMENSIONAL NONLINEAR FUZZY INTEGRAL EQUATIONS USING FUZZY BIVARIATE BLOCK-PULSE FUNCTIONS WITH ERROR ESTIMATION

In this paper, we propose an iterative procedure based on two dimensionalfuzzy block-pulse functions for solving nonlinear fuzzy Fredholm integralequations of the second kind. The error estimation and numerical stabilityof the proposed method are given in terms of supplementary Lipschitz condition.Finally, illustrative examples are included in order to demonstrate the accuracyand convergence of...

متن کامل

Semiparametric estimators of functional measurement error models with unknown error

We consider functional measurement error models where the measurement error distribution is estimated non-parametrically.We derive a locally efficient semiparametric estimator but propose not to implement it owing to its numerical complexity. Instead, a plug-in estimator is proposed, where the measurement error distribution is estimated through non-parametric kernel methods based on multiple me...

متن کامل

Photometric Redshift Error Estimators

Photometric redshift (photo-z) estimates are playing an increasingly important role in extragalactic astronomy and cosmology. Crucial to many photo-z applications is the accurate quantification of photometric redshift errors and their distributions, including identification of likely catastrophic failures in photo-z estimates. We consider several methods of estimating photo-z errors and propose...

متن کامل

An Iterative Method for

It is of interest in various contexts to nd approximate feasible points to problems that have equality, inequality and bound constraints. For example, in exhaustive search algorithms for global optimization , it is of interest to construct bounds around approximate feasible points, within which a true feasible point is proven to exist. In such exhaustive search algorithms, the approximate feasi...

متن کامل

A Common Fixed Point Theorem Using an Iterative Method

Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence  ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2001

ISSN: 0377-0427

DOI: 10.1016/s0377-0427(00)00494-5